MinMax algorithms for stabilizing consensus

In the stabilizing consensus problem each agent of a networked system has an input value and is repeatedly writing output value; it required that eventually all values stabilize to same which, moreover, must be one values. We study this for synchronous model with identical anonymous agents are connected by time-varying topology may join at any time (asynchronous start). Our main result generic MinMax algorithm solves in when, sufficiently long but bounded period time, there agent, called root, can send messages, possibly indirectly, other agents. stress bound on achieving rootedness property unknown Such topologies highly dynamic (in particular, roots change arbitrarily over time) have very weak connectivity properties (an never root). distributed algorithms thus require neither central control nor global information also quite efficient terms message size storage requirements.